Efficient approximation of Sparse Jacobians for time-implicit reduced order models

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient approximation of sparse Jacobians for time-implicit reduced order models

This paper introduces a sparse matrix discrete interpolation method to effectively compute matrix approximations in the reduced order modeling framework. The sparse algorithm developed herein relies on the discrete empirical interpolation method and uses only samples of the nonzero entries of the matrix series. The proposed approach can approximate very large matrices, unlike the current matrix...

متن کامل

p-approximation of Jacobians

The paper investigates the nonlinear function spaces introduced by Giaquinta, Modica and Souček. It is shown that a function from Cart(Ω,Rm) is approximated by C functions strongly in A(Ω,R) whenever q < p. An example is shown of a function which is in cart(Ω,R) but not in cart(Ω,R).

متن کامل

Efficient approximation of probability distributions with k-order decomposable models

During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models. Some of these algorithms can be used to search for a maximum likelihood decomposable model with a given maximum clique size, k. Unfortunately, the problem of learning a maximum likelihood decomposable model given a maximum clique size is NP-hard for k > 2. In t...

متن کامل

Reliable reduced-order models for time-dependent linearized Euler equations

Development of optimal reduced-order models for linearized Euler equations is investigated. Recent methods based on proper orthogonal decomposition (POD), applicable for high-order systems, are presented and compared. Particular attention is paid to the link between the choice of the projection and the efficiency of the reduced model. A stabilizing projection is introduced to induce a stable re...

متن کامل

Efficient Low-Order Approximation of First-Passage Time Distributions.

We consider the problem of computing first-passage time distributions for reaction processes modeled by master equations. We show that this generally intractable class of problems is equivalent to a sequential Bayesian inference problem for an auxiliary observation process. The solution can be approximated efficiently by solving a closed set of coupled ordinary differential equations (for the l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal for Numerical Methods in Fluids

سال: 2016

ISSN: 0271-2091

DOI: 10.1002/fld.4260